Uniform coverings of 2-paths in the complete bipartite directed graph
نویسندگان
چکیده
Let G be a directed graph and H a subgraph of G. A D(G,H, λ) design is a multiset D of subgraphs of G each isomorphic to H so that every directed 2-path in G lies in exactly λ subgraphs in D. In this paper, we show that there exists a D(K∗ n,n, −→ C 2n, 1) design for every n ≥ 2, where K∗ n,n is the complete bipartite directed graph and −→ C 2n is a directed Hamilton cycle in K∗ n,n.
منابع مشابه
Independent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملHIGHER ORDER MATCHING POLYNOMIALS AND d-ORTHOGONALITY
We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the higher-order matching polynomial corresponds to coverings by paths. Several families of classical orthogonal polynomials—the Chebyshev, Hermite, and Laguerre poly...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کامل